A Non-deterministic Grammar Inference Algorithm Applied to the Cleavage Site Prediction Problem in Bioinformatics

نویسندگان

  • Gloria Inés Alvarez
  • Jorge Hernán Victoria
  • Enrique Bravo
  • Pedro García
چکیده

We report results on applying the OIL (Order Independent Language) grammar inference algorithm to predict cleavage sites in polyproteins from translation of Potivirus genome. This non-deterministic algorithm is used to generate a group of models which vote to predict the occurrence of the pattern. We built nine models, one for each cleavage site in this kind of virus genome and report sensibility, specificity, accuracy for each model. Our results show that this technique is useful to predict cleavage sites in the given task with accuracy rates higher than 95%.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reporte Interno CIC: Results on Using Grammatical Inference to Solve the Cleavage Site Prediction Problem

The goal of this research is to evaluate the performance of two grammatical inference algorithms in the cleavage site prediction problem both in potyviridae poliprotein sequences and in signal peptides. We plan to compare the performance of our algorithms with other approaches available at this time. Cleavage site prediction is a well known problem in bioinformatics, it consists in predict the ...

متن کامل

Reduced Bio-basis Function Neural Networks for Protease Cleavage Site Prediction

This paper presents a new neural learning algorithm for protease cleavage site prediction. The basic idea is to replace the radial basis function used in radial basis function neural networks by a so-called bio-basis function using amino acid similarity matrices. Mutual information is used to select bio-bases and a corresponding selection algorithm is developed. The algorithm has been applied t...

متن کامل

A reactive bone route algorithm for solving the traveling salesman problem

The traveling salesman problem (TSP) is a well-known optimization problem in graph theory, as well as in operations research that has nowadays received much attention because of its practical applications in industrial and service problems. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The obje...

متن کامل

Fuzzy Inference System Approach in Deterministic Seismic Hazard, Case Study: Qom Area, Iran

Seismic hazard assessment like many other issues in seismology is a complicated problem, which is due to a variety of parameters affecting the occurrence of an earthquake. Uncertainty, which is a result of vagueness and incompleteness of the data, should be considered in a rational way. Using fuzzy method makes it possible to allow for uncertainties to be considered. Fuzzy inference system,...

متن کامل

Predicting stock prices on the Tehran Stock Exchange by a new hybridization of Fuzzy Inference System and Fuzzy Imperialist Competitive Algorithm

Investing on the stock exchange, as one of the financial resources, has always been a favorite among many investors. Today, one of the areas, where the prediction is its particular importance issue, is financial area, especially stock exchanges. The main objective of the markets is the future trend prices prediction in order to adopt a suitable strategy for buying or selling. In general, an inv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010